Approximating the Maximum Internal Spanning Tree problem
نویسندگان
چکیده
منابع مشابه
Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem
Given a vertex-weighted connected graphG = (V,E), the maximum weight internal spanning tree (MwIST for short) problem asks for a spanning tree T of G such that the total weight of the internal vertices in T is maximized. The unweighted variant, denoted as MIST, is NPhard and APX-hard, and the currently best approximation algorithm has a proven performance ratio 13/17. The currently best approxi...
متن کاملThe maximum f-depth spanning tree problem
This paper deals with the problem of constructing directed trees of optimal weight and root r with depth at most f(|V |) (called f − depthDSTPr). We first prove that the maximization and the minimization versions are equal-approximable under the differential ratio, that measures how the value of an approximate solution is placed in the interval between the worst and the best solutions values of...
متن کاملA 2k-vertex Kernel for Maximum Internal Spanning Tree
We consider the parameterized version of the maximum internal spanning tree problem, which, given an n-vertex graph and a parameter k, asks for a spanning tree with at least k internal vertices. Fomin et al. [J. Comput. System Sci., 79:1–6] crafted a very ingenious reduction rule, and showed that a simple application of this rule is sufficient to yield a 3k-vertex kernel. Here we propose a nove...
متن کاملAn Exact Algorithm for the Maximum Leaf Spanning Tree Problem
Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leaves k, this problem can be solved in time O(4poly(n)) using a simple branching algorithm introduced by a subset of the authors [12]. Daligault, Gutin, Kim, and Yeo [6] improved the branching and obtained a running time ...
متن کاملA Linear Vertex Kernel for Maximum Internal Spanning Tree
We present an algorithm that for any graph G and integer k ≥ 0 in time polynomial in the size of G either nds a spanning tree with at least k internal vertices, or outputs a new graph GR on at most 3k vertices and an integer k′ such that G has a spanning tree with at least k internal vertices if and only if GR has a spanning tree with at least k ′ internal vertices. In other words, we show that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.08.029